Groups for which it is easy to detect graphical regular representations
نویسندگان
چکیده
We say that a finite group G is DRR-detecting if, for every subset S of G, either the Cayley digraph Cay(G,S) digraphical regular representation (that is, its automorphism acts regularly on vertex set) or there nontrivial φ such φ(S) = S. show nilpotent p-group, but wreath product Zp wr not DRR-detecting, odd prime p. also if G1 and G2 are groups admit gcd(|G1|, |G2|) 1, then direct x DRR-detecting. Some these results have analogues graphical representations.
منابع مشابه
Planar Graphical Models which are Easy
We describe a rich family of binary variables statistical mechanics models on a given planar graph which are equivalent to Gaussian Grassmann Graphical models (free fermions) defined on the same graph. Calculation of the partition function (weighted counting) for such a model is easy (of polynomial complexity) as reducible to evaluation of a Pfaffian of a matrix of size equal to twice the numbe...
متن کاملDistinguished positive regular representations
Let $G$ be a tamely ramified reductive $p$-adic group. We study distinction of a class of irreducible admissible representations of $G$ by the group of fixed points $H$ of an involution of $G$. The representations correspond to $G$-conjugacy classes of pairs $(T,phi)$, where $T$ is a tamely ramified maximal torus of $G$ and $phi$ is a quasicharacter of $T$ whose restriction t...
متن کاملIs it easy to stop RNA polymerase?
Among transcription factors that bind to bacterial RNA polymerase (RNAP) and modulate its activity, a number of small molecules irreversibly inhibit RNAP thereby causing cell death. To be of clinical significance such inhibitors must (1) inhibit a broad range of bacterial RNAPs but not affect human cells, (2) penetrate bacterial cell walls and (3) circumvent bacterial resistance mechanisms. Rif...
متن کاملgroups for which the noncommuting graph is a split graph
the noncommuting graph $nabla (g)$ of a group $g$ is asimple graph whose vertex set is the set of noncentral elements of$g$ and the edges of which are the ones connecting twononcommuting elements. we determine here, up to isomorphism, thestructure of any finite nonabeilan group $g$ whose noncommutinggraph is a split graph, that is, a graph whose vertex set can bepartitioned into two sets such t...
متن کاملRegular Representations of Time-Frequency Groups
In this paper, we study the Plancherel measure of a class of non-connected nilpotent groups which is of special interest in Gabor theory. Let G be a time-frequency group. That is G = ⟨ Tk,Ml : k ∈ Z, l ∈ BZ ⟩ , where Tk, Ml are translations and modulations operators acting in L(R), and B is a non-singular matrix. We compute the Plancherel measure of the left regular representation of G which is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The art of discrete and applied mathematics
سال: 2021
ISSN: ['2590-9770']
DOI: https://doi.org/10.26493/2590-9770.1373.60a